Complete Padovan Sequences in Finite Fields
نویسندگان
چکیده
Given a prime p ≥ 5, and given 1 < κ < p − 1, we call a sequence (an)n in Fp a Φκ-sequence if it is periodic with period p− 1, and if it satisfies the linear recurrence an + an+1 = an+κ with a0 = 1. Such a sequence is said to be a complete Φκ-sequence if in addition {a0, a1, . . . , ap−2} = {1, . . . , p− 1}. For instance, every primitive root b mod p generates a complete Φκ-sequence an = b n for some (unique) κ. A natural question is whether every complete Φκ-sequence is necessarily defined by a primitive root. For κ = 2 the answer is known to be positive. In this paper we reexamine that case and investigate the case κ = 3 together with the associated cases κ = p− 2 and κ = p− 3.
منابع مشابه
The Jacobsthal Sequences in Finite Groups
Abstract In this paper, we study the generalized order- Jacobsthal sequences modulo for and the generalized order-k Jacobsthal-Padovan sequence modulo for . Also, we define the generalized order-k Jacobsthal orbit of a k-generator group for and the generalized order-k Jacobsthal-Padovan orbit a k-generator group for . Furthermore, we obtain the lengths of the periods of the generalized order-3 ...
متن کاملPell–Padovan-circulant sequences and their applications
This paper develops properties of recurrence sequences defined from circulant matrices obtained from the characteristic polynomial of the Pell–Padovan sequence. The study of these sequences modulo m yields cyclic groups and semigroups from the generating matrices. Finally, we obtain the lengths of the periods of the extended sequences in the extended triangle groups E(2, n, 2), E(2, 2, n) and E...
متن کاملPadovan-like sequences and Bell polynomials
We study a class of Padovan-like sequences that can be generated using special matrices of the third order. We show that terms of any sequence of this class can be expressed via Bell polynomials and their derivatives that use as arguments terms of another such sequence with smaller indexes. CAS Mathematica is used for cumbersome calculations and hypothesis testing.
متن کاملClassical Sequences Revisited with Permutations Avoiding Dotted Pattern
Inspired by the definition of the barred pattern-avoiding permutation, we introduce the new concept of dotted pattern for permutations. We investigate permutations classes avoiding dotted patterns of length at most 3, possibly along with other classical patterns. We deduce some enumerating results which allow us to exhibit new families of permutations counted by the classical sequences: 2n, Cat...
متن کاملDeterminantal Representations for Generalized Fibonacci and Tribonacci Numbers
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Using certain Hessenberg matrices, we provide some determinantal representations of the general terms of second-and third-order linear recurrence sequences with arbitrary initial values. Moreover, we provide explicit formu...
متن کامل